Global optimization : partitioned random
نویسنده
چکیده
We consider a combination of state space partitioning and random search methods for solving deterministic global optimization problem. We assume that function computations are costly and nding global optimum is diicult. Therefore, we may decide to stop searching long before we found a solution close to the optimum. Final reward of the algorithm is deened as the best found function value minus total cost of computations. We construct index sampling policy that is asymptotically optimal on average when number of the search regions k is large. Sampling index for each search region is deened as the stopping value of sampling from that region only. Stopping value selection policy is an improvement over myopic and heuristic index rules that are used in partitioned random search and stochastic branch-and-bound algorithms.
منابع مشابه
Frequency Reuse Impact on the Optimum Channel Allocation for a Hybrid Mobile System
In this paper we study the e ect of the frequency reuse constraints in both layers on the optimum channel allocation for a multi-cell/multi-spotbeam hybrid system. We adopt a speci c multi-faceted cost function that incorporates call-dropping due to unsuccessful hand-o attempts, and blocking of new calls. The minimization of the cost function is attempted by choosing the optimal split of the to...
متن کاملAugmented Downhill Simplex a Modified Heuristic Optimization Method
Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...
متن کاملK-Mean Clustering and PSO: A Review
Clustering is a method which divides data objects into groups based on the information found in data that describes the objects and relationships among them. There are a variety of algorithms have been developed in recent years for solving problems of data clustering. Data clustering algorithms can be either hierarchical or partitioned. Most promising among them are K-means algorithm which is p...
متن کاملOptimum Ensemble Classification for Fully Polarimetric SAR Data Using Global-Local Classification Approach
In this paper, a proposed ensemble classification for fully polarimetric synthetic aperture radar (PolSAR) data using a global-local classification approach is presented. In the first step, to perform the global classification, the training feature space is divided into a specified number of clusters. In the next step to carry out the local classification over each of these clusters, which cont...
متن کاملCache-Partitioned Tiling for Data Reuse Across Loop Nests
This paper presents cache-partitioned tiling, a systematic and integrated approach for global optimization of cache locality across multiple loop nests which reference multiple arrays. The approach is based on the idea of cache partitioning, in which the cache capacity is divided into a number of equal-sized sections. A data layout in memory is derived to eliminate cache connicts by ensuring th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995